QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment

Abstract This paper presents and proves totally correct a new algorithm, called $$\textsf{QSMA}$$ QSMA , for the satisfiability of quantified formula modulo complete theory an initial assignment. The optimized variant implemented in YicesQS is described shown to preserve total correctness. A report on performance at 2022 SMT competition included. ran $$\textsf{LIA}$$ LIA $$\textsf{NIA}$$ NIA $$\textsf{LRA}$$ LRA $$\textsf{NRA}$$ NRA $$\textsf{BV}$$ BV categories ranked second “largest contribution” award (single queries). It was only solver solve all instances, where it about two orders magnitude faster than best (Z3).